翻訳と辞書 Words near each other ・ Dynamic Ionosphere CubeSat Experiment ・ Dynamic Kernel Module Support ・ Dynamic keyword insertion ・ Dynamic Kinetic Resolution In Asymmetric Synthesis ・ Dynamic knowledge repository ・ Dynamic Language Runtime ・ Dynamic languages toolkit ・ Dynamic Leap Technology Inc. ・ Dynamic light scattering ・ Dynamic link matching ・ Dynamic linker ・ Dynamic load testing ・ Dynamic loading ・ Dynamic logic ・ Dynamic logic (digital electronics) ・ Dynamic logic (modal logic) ・ Dynamic Logical Partitioning ・ Dynamic lot-size model ・ Dynamic Man ・ Dynamic Man (Dynamic Publications) ・ Dynamic Man (Timely Comics) ・ Dynamic Manufacturing Network ・ Dynamic Markov compression ・ Dynamic Materials Corporation ・ Dynamic mechanical analysis ・ Dynamic meditation ・ Dynamic method ・ Dynamic Microprocessor Associates ・ Dynamic Microsimulation Model of the Czech Republic ・ Dynamic microsimulation pension model Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Dynamic logic (modal logic) ： ウィキペディア英語版 Dynamic logic (modal logic) Dynamic logic is an extension of modal logic originally intended for reasoning about computer programs and later applied to more general complex behaviors arising in linguistics, philosophy, AI, and other fields. ==Language== Modal logic is characterized by the modal operators $\backslash Box\; p$ (box p) asserting that $p\backslash ,\backslash !$ is necessarily the case, and $\backslash Diamond\; p$ (diamond p) asserting that $p\backslash ,\backslash !$ is possibly the case. Dynamic logic extends this by associating to every action $a\backslash ,\backslash !$ the modal operators $()\backslash ,\backslash !$ and $\backslash langle\; a\; \backslash rangle\backslash ,\backslash !$, thereby making it a multimodal logic. The meaning of $()p\backslash ,\backslash !$ is that after performing action $a\backslash ,\backslash !$ it is necessarily the case that $p\backslash ,\backslash !$ holds, that is, $a\backslash ,\backslash !$ must bring about $p\backslash ,\backslash !$. The meaning of $\backslash langle\; a\; \backslash rangle\; p\backslash ,\backslash !$ is that after performing $a\backslash ,\backslash !$ it is possible that $p\backslash ,\backslash !$ holds, that is, $a\backslash ,\backslash !$ might bring about $p\backslash ,\backslash !$. These operators are related by $()p\; \backslash equiv\; \backslash neg\; \backslash langle\; a\; \backslash rangle\; \backslash neg\; p\backslash ,\backslash !$ and $\backslash langle\; a\; \backslash rangle\; p\; \backslash equiv\; \backslash neg()\; \backslash neg\; p\backslash ,\backslash !$, analogously to the relationship between the universal ($\backslash forall\backslash ,\backslash !$) and existential ($\backslash exists\backslash ,\backslash !$) quantifiers. Dynamic logic permits compound actions built up from smaller actions. While the basic control operators of any programming language could be used for this purpose, Kleene's regular expression operators are a good match to modal logic. Given actions $a\backslash ,\backslash !$ and $b\backslash ,\backslash !$, the compound action $a\; \backslash cup\; b\backslash ,\backslash !$, ''choice'', also written $a+b\backslash ,\backslash !$ or $a|b\backslash ,\backslash !$, is performed by performing one of $a\backslash ,\backslash !$ or $b\backslash ,\backslash !$. The compound action $a;b\backslash ,\backslash !$, ''sequence'', is performed by performing first $a\backslash ,\backslash !$ and then $b\backslash ,\backslash !$. The compound action $a$ *\,\!, ''iteration'', is performed by performing $a\backslash ,\backslash !$ zero or more times, sequentially. The constant action $0\backslash ,\backslash !$ or BLOCK does nothing and does not terminate, whereas the constant action $1\backslash ,\backslash !$ or SKIP or NOP, definable as $0$ *\,\!, does nothing but does terminate. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Dynamic logic (modal logic)」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.